Posterior Cramer-Rao bounds for discrete-time nonlinear filtering

نویسندگان

  • Petr Tichavský
  • Carlos H. Muravchik
  • Arye Nehorai
چکیده

A mean-square error lower bound for the discretetime nonlinear filtering problem is derived based on the Van Trees (posterior) version of the Cramér–Rao inequality. This lower bound is applicable to multidimensional nonlinear, possibly non-Gaussian, dynamical systems and is more general than the previous bounds in the literature. The case of singular conditional distribution of the one-step-ahead state vector given the present state is considered. The bound is evaluated for three important examples: the recursive estimation of slowly varying parameters of an autoregressive process, tracking a slowly varying frequency of a single cisoid in noise, and tracking parameters of a sinusoidal frequency with sinusoidal phase modulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fresh look at Bayesian Cramér-Rao bounds for discrete-time nonlinear filtering

In this paper, we aim to relate different Bayesian Cramér-Rao bounds which appear in the discrete-time nonlinear filtering literature in a single framework. A comparative theoretical analysis of the bounds is provided in order to relate their tightness. The results can be used to provide a lower bound on the mean square error in nonlinear filtering. The findings are illustrated and verified by ...

متن کامل

A Comparison of Error Bounds for a Nonlinear Tracking System with Detection Probability Pd < 1

Error bounds for nonlinear filtering are very important for performance evaluation and sensor management. This paper presents a comparative study of three error bounds for tracking filtering, when the detection probability is less than unity. One of these bounds is the random finite set (RFS) bound, which is deduced within the framework of finite set statistics. The others, which are the inform...

متن کامل

A study of a nonlinear filtering problem for tracking an extended target

The paper presents an analysis of a nonlinear filtering problem corresponding to tracking of an extended target whose shape is modelled by an ellipse. The measurements of target extent are assumed to be available in addition to the usual positional measurements. Using Cramer-Rao bounds we establish the best achievable error performance for this highly nonlinear problem. The theoretical bounds a...

متن کامل

Conditional Posterior Cramér-Rao lower bounds for nonlinear recursive filtering

Posterior Cramér Rao lower bounds (PCRLBs) [1] for sequential Bayesian estimators provide performance bounds for general nonlinear filtering problems and have been used widely for sensor management in tracking and fusion systems. However, the unconditional PCRLB [1] is an off-line bound that is obtained by taking the expectation of the Fisher information matrix (FIM) with respect to the measure...

متن کامل

Improved Cramer-Rao Inequality for Randomly Censored Data

As an application of the improved Cauchy-Schwartz inequality due to Walker (Statist. Probab. Lett. (2017) 122:86-90), we obtain an improved version of the Cramer-Rao inequality for randomly censored data derived by Abdushukurov and Kim (J. Soviet. Math. (1987) pp. 2171-2185). We derive a lower bound of Bhattacharya type for the mean square error of a parametric function based on randomly censor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 46  شماره 

صفحات  -

تاریخ انتشار 1998